Hybrid Number Representations with Bounded Carry Propagation Chains
نویسندگان
چکیده
rl novel, hybrid number representation is proposed in this paper. It includes the two’s complement representation and the signed-digit representation ar special cases. Such a hybrid representation is capable of bounding the mazimum length of carry propagation chains during addition. Thus, one can select a specific hybrid number representation that limits the maximum length of all the carry propagation chains to any desired value between 1 and the entire word length. The framework reveals a continuum of number representations between the two eztnimes of two’s complement and signed-digit number systems and allows a unified performance analysis of the entire spectrum of adders based on the representation selected.
منابع مشابه
Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations With Bounded Carry Propagation Chains
A novel hybrid number representation is proposed in this paper. It includes the two’s complement representation and the signed-digit representation as special cases. The hybrid number representations proposed are capable of bounding the maximum length of carry propagation chains during addition to any desired value between 1 and the entire word length. The framework reveals a continuum of numbe...
متن کاملHybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations With Bounded Carry Propagation Chains
A novel hybrid number representation is proposed in this paper. It includes the two's complement representation and the signed-digit mpresentation as special cases. The hybrid number representations proposed are capable of bounding the maximum length of carry propagation chains during addition to any desired value between 1 and the entire word length. The framework reveals a continuum of number...
متن کاملHigh Speed Implementation of Adder and Multiplier Using Qsd in Fpga Technology
In this paper, we proposed a new number system for ALU. In binary number system carry is a major problem in arithmetical operation. We have to suffer O(n) carry propagation delay in n-bit binary operation. To overcome this problem signed digit is required for carry free arithmetical operation. Carry look ahead helps to improve the propagation delay to O(log n), but is bounded to a small number ...
متن کاملQuaternary Arithmetic Logic Unit on a Programmable Logic Device
Common binary arithmetic operations such as addition/subtraction and multiplication suffer from O(n) carry propagation delay where n is the number of digits. Carry lookahead helps to improve the propagation delay to O(log n), but is bounded to a small number of digits due to the complexity of the circuit. A carry-free arithmetic operation can be achieved using a higher radix number system such ...
متن کاملTransformations of Signed-Binary Number Representations for Efficient VLSI Arithmetic
The VLSI implementation of arithmetic operations may be significantly improved by using non-conventional number representations and transforming intermediate results from one format to another format. For a target function, the objective is to change the number representations of the input and output operands such that a minimum amount of logic circuitry is required to achieve a computation. Re...
متن کامل